Optimized Sectorization of Airspace with Constraints
نویسندگان
چکیده
In this paper we consider the Optimized Airspace Sectorization Problem (ASP) with constraints in which a given airspace is to be partitioned into a number of sectors. The objective of ASP is to minimize the coordination workload between adjacent sectors. We proposed a constraint programming approach to optimize the sectorization that shall satisfy all specific constraints e.g. the controllers’ workload is balanced among the sectors, the sectors are not fragmented, aircraft can not enter twice the same sector; aircraft cannot stay less than a given amount of time in each sector crossed, sectors cannot be fragmented etc. Introduction Sectorization is a fundamental architectural feature of the Air Traffic Control (ATC) system. The airspace is divided into a number of sectors, each of them is assigned to a team of controllers (Control Positions). Controllers of a given sector have (1) to monitor the flights, (2) to avoid conflicts between aircraft and (3) to exchange information with adjacent sectors where aircraft have planned to go. These tasks induce a workload which is often decomposed into three corresponding parts [1, 2, 3]: • The monitoring workload (MW) comes from the cyclic checking of aircraft trajectories. • The conflict workload (CW) results from resolution and avoidance of conflicts between aircraft. • The coordination workload (OW) is basically related to the exchanges that have to be performed between controllers of adjacent sectors and pilots of aircraft that are crossing through. But the air traffic changes over the day. This often leads to workload imbalance between the sectors. Furthermore, it is desirable that there are more the sectors (then more control positions) in the dense traffic periods of the day than the weak periods. Hence a tool to “dynamically” re-sectorize the airspace (more precisely a part of airspace – e.g. the sectors of a Air Traffic Control Center) is required to cope with the evolution of the traffic. When the sectors are designed, not only the balance constraint must be hold (in term of workload), but also that several following specific constraints have to be taken into account: • Convexity constraint. The same aircraft can not enter twice the same sector. It is not sensible, but it happened in the past, e.g. national boundaries in European airspace. For instance, the following case in the Figure 1 is not admissible:
منابع مشابه
Airspace sectorization with constraints
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related...
متن کاملA Sectorization Method for Dynamic Airspace Configuration
The Dynamic Airspace Configuration (DAC) concept requires strategically organizing and efficiently allocating airspace. In the current National Airspace System (NAS), sector boundaries have been developed heuristically over decades in light of historical data and analysis. In our previous efforts, a graph model based on air route structure was developed to model the en-route airspace over the U...
متن کاملBalancing Controllers’ Workload by Locally Redesigning Airspace Sectors
We study an Airspace Resectorization Problem (ARP). A sectorization is a subdivision of an airspace into sectors, each managed by an airtraffic controller. A wellbalanced sectorization is a sectorization that distributes the workload evenly among the controllers. We discuss the problem of generating optimal sectorizations and describe GeoSect-Local, a tool that improves a given sectorization by...
متن کاملLocal Redesigning of Airspace Sectors
In this paper we study the Airspace Sectorization Problem (ASP) where the goal is to find an optimal partition (sectorization) of the airspace into a certain number of sectors, each managed by an air traffic controller. The objective of the ASP is to find a “well-balanced” sectorization that distributes the workload evenly among the controllers. We formulate the ASP as a partitioning problem of...
متن کاملAirspace Sector Redesign Based on Voronoi Diagrams
Dynamic resectorization is a promising concept to accommodate the increasing and fluctuating demands of flight operations in the National Airspace System. At the core of dynamic resectorization is finding an optimal sectorization. Finding such an optimal sectorization is challenging because it mixes the graph partition problem and NP-hard optimization problem. This paper revisits Voronoi diagra...
متن کامل